Shift-invert Arnoldi Approximation to the Toeplitz
نویسنده
چکیده
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and recurrence coefficients produced by this method are exploited to approximate the Toeplitz matrix exponential. Toeplitz matrix inversion formula and rapid Toeplitz matrix-vector multiplications are utilized to lower the computational costs. For convergence analysis, a sufficient condition is established to guarantee that the error bound is independent of the norm of the matrix. Numerical results are given to demonstrate the efficiency of the method.
منابع مشابه
Fast numerical solution for fractional diffusion equations by exponential quadrature rule
After spatial discretization to the fractional diffusion equation by the shifted Grünwald formula, it leads to a system of ordinary differential equations, where the resulting coefficient matrix possesses the Toeplitz-like structure. An exponential quadrature rule is employed to solve such a system of ordinary differential equations. The convergence by the proposed method is theoretically studi...
متن کاملFast exponential time integration scheme for option pricing with jumps
A fast exponential time integration scheme is considered for pricing European and double barrier options in jump-diffusion models. After spatial discretization, the option pricing problem is transformed into the product of a matrix exponential and a vector, while the matrix bears a Toeplitz structure. The shift-and-invert Arnoldi method is then employed for fast approximations to such operation...
متن کاملFast Exponential Time Integration for Pricing Options in Stochastic Volatility Jump Diffusion Models
The stochastic volatility jump diffusion model with jumps in both return and volatility leads to a two-dimensional partial integro-differential equation (PIDE). We exploit a fast exponential time integration scheme to solve this PIDE. After spatial discretization and temporal integration, the solution of the PIDE can be formulated as the action of an exponential of a block Toeplitz matrix on a ...
متن کاملRational Krylov approximation of matrix functions: Numerical methods and optimal pole selection∗
Matrix functions are a central topic of linear algebra, and problems of their numerical approximation appear increasingly often in scientific computing. We review various rational Krylov methods for the computation of large-scale matrix functions. Emphasis is put on the rational Arnoldi method and variants thereof, namely, the extended Krylov subspace method and the shift-and-invert Arnoldi met...
متن کاملBackward error analysis of the shift-and-invert Arnoldi algorithm
We perform a backward error analysis of the inexact shift-and-invert Arnoldi algorithm. We consider inexactness in the solution of the arising linear systems, as well as in the orthonormalization steps, and take the non-orthonormality of the computed Krylov basis into account. We show that the computed basis and Hessenberg matrix satisfy an exact shift-and-invert Krylov relation for a perturbed...
متن کامل